Minimum reload cost cycle cover in complete graphs
نویسندگان
چکیده
منابع مشابه
Minimum Reload Cost Cycle Cover in Complete Graphs
The reload cost refers to the cost that occurs along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. Galbiati et al. [1] introduced the Minimum Reload Cost Cycle Cover problem, which is to find a set of vertex-disjoint cycles spanning all vertices with minimum reload cost. They proved that this problem is strongly NP-hard and not appro...
متن کاملReload cost problems: minimum diameter spanning tree
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of di(erent colors. We consider the problem of 0nding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On th...
متن کاملMinimum cycle bases of direct products of complete graphs
This paper presents a construction of a minimum cycle basis for the direct product of two complete graphs on three or more vertices. With the exception of two special cases, such bases consist entirely of triangles. © 2007 Elsevier B.V. All rights reserved.
متن کاملOn the Complexity of Constructing Minimum Reload Cost Path-Trees
The reload cost concept refers to the cost that occurs at a vertex along a path on an edge-colored graph when it traverses an internal vertex between two edges of different colors. The reload cost depends only on the colors of the traversed edges. Previous work on reload costs focuses on the problem of finding a spanning tree that minimizes the total reload cost from a source vertex to all othe...
متن کاملMinimum Vertex Cover in Rectangle Graphs
We consider the Minimum Vertex Cover problem in intersection graphs of axis-parallel rectangles on the plane. We present two algorithms: The first is an EPTAS for non-crossing rectangle families, rectangle families R where R1 \ R2 is connected for every pair of rectangles R1, R2 ∈ R. This algorithm extends to intersection graphs of pseudo-disks. The second algorithm achieves a factor of (1.5 + ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2019
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.21884